Strategic reasoning with a bounded number of resources: The quest for tractability

The resource-bounded alternating-time temporal logic RB±ATL combines strategic reasoning with about resources. Its model-checking problem is known to be 2exptime-complete (the same as its proper extension RB±ATL⁎) and fragments have been identified lower the complexity. In this work, we consider variant RB±ATL+ that allows for Boolean combinations of path formulae starting single operators, but restricted a resource, providing an interesting trade-off between expressivity resource analysis. We show agent Δ2P-complete, hence standard branching-time CTL+. case resources comes at no extra computational cost. When fixed finite set linear-time operators considered, drops ptime, which includes special resource. Furthermore, that, arbitrary number agents resources, can solved in exptime using sophisticated Turing reduction parity game alternating vector addition systems states (AVASS).